Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
نویسنده
چکیده
Shoup proved that various message-authentication codes of the form (n, m) 7→ h(m) + f(n) are secure against all attacks that see at
منابع مشابه
Another Look at PMAC
We can view an existing Message Authentication Code (MAC) as a Carter-Wegman MAC in spite of the fact it may not have been designed as one. This will make the analysis easier than it has been when considered from other viewpoints. In this paper, we can look PMAC with two keys as a Carter-Wegman MAC and get a simple security proof for it. Using this viewpoint to look at PMAC, we will learn not o...
متن کاملQuantum message authentication codes
I describe protocols which assure the recipient of a quantum state that it has come from a sender with whom he has previously shared secret key. Their security is information-theoretic (“unconditional”) rather than based on computational assumptions. A particular class of such protocols is constructed, for which the different keys correspond to different, secret, quantum error detecting codes. ...
متن کاملA Message Authentication Code Based on Latin Squares
This is a proposal on the construction of a Message Authen-tication Code (MAC) based on Latin Squares. The design is inspired by Wegman-Carter construction which takes advantage of provable security. The MAC is described and its security is examined. It is also compared with other MACs and its advantages are shown.
متن کاملEncrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory
At CRYPTO 2016, Cogliati and Seurin introduced the Encrypted Davies-Meyer construction, p2(p1(x) ⊕ x) for two n-bit permutations p1, p2, and proved security up to 2 . We present an improved security analysis up to 2/(67n). Additionally, we introduce the dual of the Encrypted Davies-Meyer construction, p2(p1(x)) ⊕ p1(x), and prove even tighter security for this construction: 2/67. We finally dem...
متن کاملEWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
We propose a nonce-based MAC construction called EWCDM (Encrypted Wegman-Carter with Davies-Meyer), based on an almost xoruniversal hash function and a block cipher, with the following properties: (i) it is simple and efficient, requiring only two calls to the block cipher, one of which can be carried out in parallel to the hash function computation; (ii) it is provably secure beyond the birthd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005